منابع مشابه
A binary search problem on graphs
Franzkeit, R., A binary search problem on graphs, Discrete Applied Mathematics 36 (1992) 83-86. Let G = (V, E) be a graph and e’~ E an unknown edge. I:, order to find e’ we choose a sequence of test sets WC V, where aftev every test we are told whether both vertices incident to e’ are in W, or not. For C(Gj, L,,~ Aminimum number of tests required, the inequality c(G)? rlogz 1~11 clearly holds (...
متن کاملNote on a Helicopter Search Problem on Graphs
We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for the cop in this problem depends only on the robber’s speed. We investigate the problem of finding the minimal robber’s speed which prevents the cop from winning. For this parameter we give tight bounds in terms of the li...
متن کاملTernary search
This note is dedicated to the memory of our teacher E.W. Dijkstra, since he would have appreciated the problem and would probably have solved it nicer than we can do below. Our problem is about three ascending sequences of numbers. It was inspired by [2], exercise C-3.1 (p. 213), which is about two ascending sequences. In order to formulate the problem and its solution, we need some notation on...
متن کاملThe Discrete Logarithm Problem and Ternary Functional Graphs
Encryption is essential to the security of transactions and communications, but the algorithms on which they rely might not be as secure as we all assume. In this paper, we investigate the randomness of the discrete exponentiation function used frequently in encryption. We show how we used exponential generating functions to gain theoretical data for mapping statistics in ternary functional gra...
متن کاملRandomized Ternary Search Tries
A simple method for maintaining balance in ternary search tries is presented. The new kind of self-balancing ternary search trie, called an r-trie, generalizes the balancing strategy of Aragon and Seidel’s randomized binary search trees (treaps). This means that an r-trie is shaped like a ternary search trie built by inserting the strings in random order. As a result, the time cost of searching...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1989
ISSN: 0166-218X
DOI: 10.1016/0166-218x(89)90030-9